On minimal forbidden subgraph characterizations of balanced graphs
نویسندگان
چکیده
منابع مشابه
On minimal forbidden subgraph characterizations of balanced graphs
A graph is balanced if its clique-matrix contains no edge-vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs ...
متن کاملMinimal forbidden sets for degree sequence characterizations
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. Barrus, Kumbhat, and Hartke [4] called F a degree-sequence-forcing (DSF) set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. A DSF set is minimal if no proper subset is also DSF. In this paper, we present new properties of m...
متن کاملEnumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition
Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative purposes. By building on the work of Gioan and Paul (2012) and Chauve et al. (2014), we show a methodology by which we constrain a split-decomposition tree to avoid certain patterns, thereby avoiding the corresponding ...
متن کاملColoring Graphs Characterized by a Forbidden Subgraph
The Coloring problem is to test whether a given graph can be colored with at most k colors for some given k, such that no two adjacent vertices receive the same color. The complexity of this problem on graphs that do not contain some graph H as an induced subgraph is known for each fixed graph H. A natural variant is to forbid a graph H only as a subgraph. We call such graphs strongly H-free an...
متن کاملForbidden subgraph characterization of bipartite unit probe interval graphs
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices is a probe. When all intervals have the same length (or equivalently, no interval contains another properly) the graph is a unit probe in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.04.001